Triangularly connected claw-free graph
نویسندگان
چکیده
A graph G is triangularly connected if for every pair of edges e1, e2 ∈ E(G), G has a sequence of 3-cycles C1, C2, · · · , Cl such that e1 ∈ C1, e2 ∈ Cl and such that E(Ci) ∩ E(Ci+1) 6= ∅, (1 ≤ i ≤ l − 1). In this paper it is shown that every triangularly connected claw-free graph G with |E(G)| ≥ 3 is vertex pancyclic. This implies the former results in [2], [3], [4] and [5] that every connected, locally connected claw-free graph is vertex pancyclic.
منابع مشابه
A Closure for 1-Hamilton-Connectedness in Claw-Free Graphs
A graph G is 1-Hamilton-connected if G − x is Hamilton-connected for every vertex x ∈ V (G). In the paper we introduce a closure concept for 1-Hamiltonconnectedness in claw-free graphs. If G is a (new) closure of a claw-free graph G, then G is 1-Hamilton-connected if and only if G is 1-Hamilton-connected, G is the line graph of a multigraph, and for some x ∈ V (G), G − x is the line graph of a ...
متن کاملSpanning eulerian subgraphs in N -locally connected claw-free graphs
A graph G is Nm-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connected N2-locally connected claw-free graph and 3-edge-connected N3-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].
متن کاملSpanning eulerian subgraphs in N2-locally connected claw-free graphs
A graph G is Nm-locally connected if for every vertex v in G, the vertices not equal to v and with distance at most m to v induce a connected subgraph in G. We show that both connectedN2-locally connected claw-free graph and 3-edge-connected N3-locally connected claw-free graph have connected even [2, 4]-factors, which settle a conjecture by Li in [6].
متن کاملOn 1-Hamilton-connected claw-free graphs
A graph G is k-Hamilton-connected (k-hamiltonian) if G−X is Hamilton-connected (hamiltonian) for every setX ⊂ V (G) with |X| = k. In the paper, we prove that (i) every 5-connected claw-free graph with minimum degree at least 6 is 1Hamilton-connected, (ii) every 4-connected claw-free hourglass-free graph is 1-Hamilton-connected. As a byproduct, we also show that every 5-connected line graph with...
متن کاملPancyclicity of 4-Connected, Claw-Free, P10-Free Graphs
A graph G is said to be pancyclic if G contains cycles of all lengths from 3 to |V (G)|. We show that if G is 4-connected, claw-free, and P10-free, then G is either pancyclic or it is the line graph of the Petersen graph. This implies that every 4-connected, claw-free, P9-free graph is pancyclic, which is best possible and extends a result of Gould et al. Pancyclicity in 3-connected graphs: Pai...
متن کامل